- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources4
- Resource Type
-
0001000003000000
- More
- Availability
-
31
- Author / Contributor
- Filter by Author / Creator
-
-
Lange, Tanja (4)
-
Banegas, Gustavo (2)
-
Bernstein, Daniel J. (2)
-
Bai, Shi (1)
-
Bernstein, Daniel J (1)
-
Campos, Fabio (1)
-
Chou, Tung (1)
-
Cottaar, Jolijn (1)
-
Johnson, Floyd B (1)
-
Meyer, Michael (1)
-
Ngo, Tran (1)
-
Smith, Benjamin (1)
-
Sotáková, Jana (1)
-
Van Hoof, Iggy (1)
-
van Hoof, Maya-Iggy (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
- Filter by Editor
-
-
Guo, Jian (1)
-
Steinfeld, Ron (1)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
The literature sometimes uses slow algorithms to find minimum-length continued-fraction differential addition chains to speed up subsequent computations of multiples of points on elliptic curves. This paper introduces two faster algorithms to find these chains. The first algorithm prunes more effectively than previous algorithms. The second algorithm uses a meet-in-the-middle approach and appears to have a limiting cost exponent below 1more » « lessFree, publicly-accessible full text available June 1, 2026
-
Bai, Shi; van Hoof, Maya-Iggy; Johnson, Floyd B; Lange, Tanja; Ngo, Tran (, Lecture notes in computer science)Guo, Jian; Steinfeld, Ron (Ed.)
-
Banegas, Gustavo; Bernstein, Daniel J.; Campos, Fabio; Chou, Tung; Lange, Tanja; Meyer, Michael; Smith, Benjamin; Sotáková, Jana (, IACR transactions on cryptographic hardware and embedded systems)
-
Banegas, Gustavo; Bernstein, Daniel J.; Van Hoof, Iggy; Lange, Tanja (, IACR transactions on cryptographic hardware and embedded systems)
An official website of the United States government
